A suboptimal solution to nonconvex optimal control problems involving input - affine dynamic models
نویسندگان
چکیده
This papers presents a convex approximation method for the solution of nonconvex optimal control problems involving input-affine dynamic models. The method relies in the availability of full reference state trajectories. By using these states references as real states trajectories, the dynamic model is approximated such that the resulting problem becomes convex. The convexified problem is solved by efficient convex methods delivering a suboptimal solution. This solution is used to linearize the original nonconvex problem such that the minimizer is refined by solving a new convex problem. Consequently, the solution to the original problem is obtained in two steps. An assessment of the errors in the approximation as a function of the mismatch between state reference trajectories and a perfect traceable trajectory is provided. The method is exemplified by formulating the optimal control problem of an isothermal continuous stirred tank reactor with Van den Vusse reactions.
منابع مشابه
An automatic initialization procedure in parameter estimation problems with parameter-affine dynamic models
This paper proposes an initialization approach for parameter estimation problems (PEPs) involving parameter-affine dynamic models. By using the state measurements, the nonconvex PEP is modified such that a convex approximation to the original PEP is obtained. The modified problem is solved by vailable online 5 November 2009 eywords: arameter estimation ultiple shooting onvex optimization convex...
متن کاملAffine Monotonic and Risk-Sensitive Models in Dynamic Programming
In this paper we consider a broad class of infinite horizon discrete-time optimal control models that involve a nonnegative cost function and an affine mapping in their dynamic programming equation. They include as special cases classical models such as stochastic undiscounted nonnegative cost problems, stochastic multiplicative cost problems, and risk-sensitive problems with exponential cost. ...
متن کاملAn Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملFriction Compensation for Dynamic and Static Models Using Nonlinear Adaptive Optimal Technique
Friction is a nonlinear phenomenon which has destructive effects on performance of control systems. To obviate these effects, friction compensation is an effectual solution. In this paper, an adaptive technique is proposed in order to eliminate limit cycles as one of the undesired behaviors due to presence of friction in control systems which happen frequently. The proposed approach works for n...
متن کاملNumerical Solution of the Controlled Harmonic Oscillator by Homotopy Perturbation Method
The controlled harmonic oscillator with retarded damping, is an important class of optimal control problems which has an important role in oscillating phenomena in nonlinear engineering systems. In this paper, to solve this problem, we presented an analytical method. This approach is based on the homotopy perturbation method. The solution procedure becomes easier, simpler and mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010